A genetic algorithm for optimization of integrated scheduling of cranes, vehicles, and storage platforms at automated container terminals
نویسندگان
چکیده
Commonly in container terminals, the containers are stored in yards on top of each other using yard cranes. The split-platform storage/retrieval system (SP-AS/RS) has been invented to store containers more efficiently and to access them more quickly. The integrated scheduling of quay cranes, automated guided vehicles and handling platforms in SP-AS/RS has been formulated and solved using the simulated annealing algorithm in previous literatures. This paper presents a genetic algorithm (GA) to solve this problem more accurately and precisely. The GA includes a new operator to make a random string of tasks observing the precedence relations between the tasks. For evaluating the performance of the GA, 10 small size test cases were solved by using the proposed GA and the results were compared to those from the literature. Results show that the proposed GA is able to find fairly near optimal solutions similar to the existing simulated annealing algorithm. Moreover, it is shown that the proposed GA outperforms the existing algorithm when the number of tasks in the scheduling horizon increases (e.g. 30 to 100). © 2013 Elsevier B.V. All rights reserved.
منابع مشابه
Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملScheduling in Container Terminals using Network Simplex Algorithm
In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...
متن کاملQuay Cranes and Yard Trucks Scheduling Problem at Container Terminals
A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 270 شماره
صفحات -
تاریخ انتشار 2014